Decision-Making Optimization of TMT: A Simulated Annealing Algorithm Analysis

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decision-Making Optimization of TMT: A Simulated Annealing Algorithm Analysis

The decision-making of Top management team (TMT) has been a hot point in academic. The paper find out annealing algorithm method can effectively solve the decision-making optimization problem. Through considering the quality and efficiency of decision-making, applying the annealing algorithm, the optimal decision preference sequence is found. Finally, an application case is proposed. Through de...

متن کامل

portfolio optimization with simulated annealing algorithm

the markowitz issue of optimization can’t be solved by precise mathematical methods such as second order schematization, when real world condition and limitations are considered. on the other hand, most managers prefer to manage a small portfolio of available assets in place of a huge portfolio. it can be analogized to cardinal constrains, that is, constrains related to minimum and maximum curr...

متن کامل

Comparative Analysis of Bacterial Foraging Optimization Algorithm with Simulated Annealing

Bacterial foraging optimization algorithm (BFOA) has been widely accepted as a global optimization algorithm of current interest for optimization and control. BFOA is inspired by the social foraging behavior of Escherichia coli. BFOA has already drawn the attention of researchers because of its efficiency in solving real-world optimization problems arising in several application domains. Simula...

متن کامل

A new Simulated Annealing algorithm for the robust coloring problem

The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...

متن کامل

A Performance Analysis of Memetic Algorithm, Genetic Algorithm and Simulated Annealing in Production System Optimization

Researchers laid the foundation of evolutionary algorithms in the late 60s and since then, heuristic algorithms have been widely applied to several complex scheduling and sequencing problems during the recent studies. In this paper, memetic algorithm (MA), genetic algorithm (GA) and simulated annealing (SA) are applied to a complex sequencing problem. The problem under study concerns about sequ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Service Science and Management

سال: 2010

ISSN: 1940-9893,1940-9907

DOI: 10.4236/jssm.2010.33042